Generalized list matrix partition problems on chordal graphs, parameterized by leafage Flavia Bonomo, University of Buenos Aires, Argentina. Graph k-coloring and k-clique cover are examples of partition problems in graphs, in the first case into k independent sets, in the second case into k cliques. Moreover, maximum clique and maximum independent set are examples of … Continue reading Abstracts